A New Public Key Scheme Based on Integer Factorization and Discrete Logarithm

نویسندگان

Pinkimani Goswami

Madan Mohan Singh

Bubu Bhuyan

Ayman Badawi

چکیده

In this paper, we present a new public key scheme which is a combination of RSA variant namely the Dependent-RSA (DRSA) and the general formulation of DGDLP. The security of this scheme depend equally on the integer factorization of n and the discrete logarithm on Zn, where n is a product of two large primes and Zn is the multiplicative group modulo n. The scheme is a randomized algorithm and it is at least as secure as the DRSA and ElGamal schemes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Factoring and Discrete Logarithm using IBC

In 1984, Shamir proposed the concept of the ID-based cryptosystem (IBC). Instead of generating and publishing a public key for each user, the ID-based scheme permits each user to choose his name or network address as his public key. This is advantageous to public-key cryptosystems because the public-key verification is so easy and direct. In such a way, a large public key file is not required. ...

متن کامل

Some Modification in ID-Based Public key Cryptosystem using IFP and DDLP

In 1984, Shamir [1] introduced the concept of an identity-based cryptosystem. In this system, each user needs to visit a key authentication center (KAC) and identify him self before joining a communication network. Once a user is accepted, the KAC will provide him with a secret key. In this way, if a user wants to communicate with others, he only needs to know the “identity” of his communicatio...

متن کامل

Improved Shao's Signature Scheme

In 1998, Shao proposed two digital signature schemes and claimed that the security of which is based on the difficulties of computing both integer factorization and discrete logarithm. However, in 1999, Lee demonstrated that Shao’s signature schemes can be broken if the factorization problem can be solved. This paper presents an improvement of Shao’s signature schemes and shows that it can resi...

متن کامل

A Factoring and Discrete Logarithm based Cryptosystem

This paper introduces a new public key cryptosystem based on two hard problems : the cube root extraction modulo a composite moduli (which is equivalent to the factorisation of the moduli) and the discrete logarithm problem. These two hard problems are combined during the key generation, encryption and decryption phases. By combining the IFP and the DLP we introduce a secure and efficient publi...

متن کامل